Random dyadic tilings of the unit square

Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings

We give the first polynomial upper bound on the mixing time of the edge-flip Markov chain for unbiased dyadic tilings, resolving an open problem originally posed by Janson, Randall, and Spencer in 2002 [10]. A dyadic tiling of size n is a tiling of the unit square by n non-overlapping dyadic rectangles, each of area 1/n, where a dyadic rectangle is any rectangle that can be written in the form ...

The Phase Transition for Dyadic Tilings

A dyadic tile of order n is any rectangle obtained from the unit square by n successive bisections by horizontal or vertical cuts. Let each dyadic tile of order n be available with probability p, independently of the others. We prove that for p sufficiently close to 1, there exists a set of pairwise disjoint available tiles whose union is the unit square, with probability tending to 1 as n → ∞,...

Remarks to Random Dyadi Tilings of the Unit Square

Arctic circles, domino tilings and square Young tableaux

The arctic circle theorem of Jockusch, Propp, and Shor asserts that uniformly random domino tilings of an Aztec diamond of high order are frozen with asymptotically high probability outside the “arctic circle” inscribed within the diamond. A similar arctic circle phenomenon has been observed in the limiting behavior of random square Young tableaux. In this paper, we show that random domino tili...

Tiling the Unit Square with 5 Rational Triangles

We prove that there are 14 distinct ways to tile the unit square (modulo the symmetries of the square) with 5 triangles such that the 5-tiling is not a subdivision of a tiling using fewer triangles. We then demonstrate how to construct infinitely many rational tilings in each of the 14 configurations. This stands in contrast to a long standing inability to find rational 4-tilings of the unit sq...